Procedures for Folding Transformations

نویسندگان

  • Marjan Gušev
  • David J. Evans
چکیده

Folding transformations on processor arrays result in smaller processor arrays, more efficient work for the processing elements, a decrease in I/O time and pipelineable implementations. The regular folding procedure is realized to improve the efficiency of processor arrays whilst retaining the complexity of the data communications, the processor operations and the regular data flow. The efficiency analysis shows that the implementation obtained utilizes the processor array with double efficiency. Moreover by using the same processor array problems with double dimension can be solved. Also the circular data flow can be used for cascaded algorithms.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ریخت‌شناسی انحنای تاخوردگی فرش دست‌باف تحت فشار استاتیکی

One of the most common procedures for exporting and warehousing handmade carpets is keeping them folded over one another. Handmade carpets come out of their stable states by being folded,while increasing storage time can cause serious and sometimes irreversible changes to them. In this research, a pilot model carpet has kept folded under a load equal to 50 g/cm2 and then the applied load increa...

متن کامل

Unfold/Fold Transformations For Definite Clause Programs

An unfold/fold program transformation system which extends the unfold/fold transformations of H. Tamaki and T. Sato is presented in this paper. The system consists of unfolding, simultaneous folding , and generalization + equality introduction rules. The simultaneous folding rule permits the folding of a set of folded clauses into a single clause, using a set of folding clauses, while the gener...

متن کامل

Folding transformations of the Painlevé equations

New symmetries of the Painlevé differential equations, called folding transformations, are determined. These transformations are not birational but algebraic transformations of degree 2, 3, or 4. These are associated with quotients of the spaces of initial conditions of each Painlevé equation. We make the complete list of such transformations up to birational symmetries. We also discuss corresp...

متن کامل

How to generate finite element mesh for folded airbags

This work presents a novel algorithm for generating a geometric mesh of an airbag after a series of folds are defined on it, for use in crash simulations. The process of airbag folding is simulated as a series of geometric transformations to the airbag mesh, which is modeled as a stack of connected planar layers. Along with these transformations, optimization techniques are used to minimise cha...

متن کامل

Induction Proofs by Program Transformations

Unfold/fold transformations have been studied for various declarative programming languages such as functional languages [5, 12, 21], logic programming [14, 22, 23] and constraint logic programming [1, 8, 13]. Some of the most extensively studied transformation systems for logic programs are the unfold/fold transformation systems. At a high level, unfold and fold transformations for definite lo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005